One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs
نویسندگان
چکیده
منابع مشابه
The super connectivity of the pancake graphs and the super laceability of the star graphs
A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k∗-container if it contains all the vertices of G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let (G) be the connectivity of G. A graph G is super connected if G is i∗-connected for all 1 i (G). A bipartite graph G is k∗-laceable if the...
متن کاملMutually independent hamiltonian cycles for the pancake graphs and the star graphs
A hamiltonian cycle C of a graph G is an ordered set 〈u1, u2, . . . , un(G), u1〉 of vertices such that ui 6= uj for i 6= j and ui is adjacent to ui+1 for every i ∈ {1, 2, . . . , n(G) − 1} and un(G) is adjacent to u1, where n(G) is the order of G. The vertex u1 is the starting vertex and ui is the ith vertex of C . Two hamiltonian cycles C1 = 〈u1, u2, . . . , un(G), u1〉 and C2 = 〈v1, v2, . . . ...
متن کاملMaps, One-regular Graphs and Half-transitive Graphs of Valency 4
A subgroup G of automorphisms of a graph X is said to be 1 2-transitive if it is vertex and edge but not arc-transitive. The graph X is said to be 1 2-transitive if Aut X is 1 2-transitive. The graph X is called one-regular if Aut X acts regularly on the set arcs of X. The interplay of three diierent concepts of maps, one-regular graphs and 1 2-transitive group actions on graphs of valency 4 is...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملAn Algorithm for Node-Disjoint Paths in Pancake Graphs
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n − 1 internally disjoint paths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation. key words: pancake graphs, node-to-node disjoint paths proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2014
ISSN: 1976-9172
DOI: 10.5391/jkiis.2014.24.4.430